Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography
نویسندگان
چکیده
The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuousvariable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density paritycheck (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to extend the maximum reconciliation distance between the two remote parties. Key reconciliation over multiple dimensions has been shown to further improve the error-correction performance of multi-edge LDPC codes in CV-QKD, thereby increasing both the secret key rate and distance. However, the computational complexity of LDPC decoding for long block lengths on the order of 10 bits remains a challenge. This work introduces a quasi-cyclic (QC) code construction for multi-edge LDPC codes that is highly suitable for hardware-accelerated decoding on a modern graphics processing unit (GPU). When combined with an 8-dimensional reconciliation scheme, the LDPC decoder achieves a raw decoding throughput of 1.72Mbit/s and an information throughput of 7.16Kbit/s using an NVIDIA GeForce GTX 1080 GPU at a maximum distance of 160km with a secret key rate of 4.10×10−7 bits/pulse for a rate 0.02 multi-edge code with block length of 10 bits when finite-size effects are considered. This work extends the previous maximum CV-QKD distance of 100km to 160km, while delivering between 1.07× and 8.03× higher decoded information throughput over the upper bound on the secret key rate for a lossy channel. For distances beyond 130km, the GPU decoder delivers an information throughput between 1868× and 18790× higher than the achievable secret key rates with a 1MHz light source. The GPU-based QC-LDPC decoder achieves a 1.29× improvement in throughput over the best existing GPU decoder implementation for a rate 1/10 multi-edge LDPC code with block length of 2 bits. These results show that LDPC decoding is no longer the computational bottleneck in long-distance CV-QKD, and that the secret key rate remains limited only by the physical parameters of the quantum channel and the latency of privacy amplification. Keywords—Quantum key distribution, QKD, continuous-variable QKD, reverse reconciliation, LDPC codes, LDPC decoding, multiedge LDPC codes, quasi-cyclic LDPC codes, GPU decoding.
منابع مشابه
Blind reconciliation
Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close...
متن کاملInformation Reconciliation for Continuous-Variable Quantum Key Distribution using Non-Binary Low-Density Parity-Check Codes
An information reconciliation method for continuous-variable quantum key distribution with Gaussian modulation that is based on non-binary low-density paritycheck (LDPC) codes is presented. Sets of regular and irregular LDPC codes with different code rates over the Galois fields GF(8), GF(16), GF(32), and GF(64) have been constructed. We have performed simulations to analyze the efficiency and ...
متن کاملEasily Implemented Rate Compatible Reconciliation Protocol for Quantum Key Distribution
Reconciliation is an important step to correct errors in Quantum Key Distribution (QKD). In QKD, after comparing basis, two legitimate parties possess two correlative keys which have some differences and they could obtain identical keys through reconciliation. In this paper, we present a new rate compatible reconciliation scheme based on Row Combining with Edge Variation (RCEV) Low Density Pari...
متن کاملRate-Adaptive LDPC-based Key Reconciliation for High Performance Quantum Key Distribution
The postprocessing or secret-key distillation process in quantum key distribution (QKD) mainly involves two well-known procedures: information reconciliation and privacy amplification. Information or key reconciliation has been customarily studied in terms of efficiency. During this, some information needs to be disclosed for reconciling discrepancies in the exchanged keys. The leakage of infor...
متن کاملEfficient Rate-Adaptive Reconciliation in Quantum Key Distribution
The purpose of reconciliation, one of classical aspects of quantum key distribution (QKD) protocol, is to mitigate errors after the distribution of quantum information over a quantum channel. In this work, a rate-adaptive method is proposed by means of a channel coding scheme where specific low-density parity-check (LDPC) codes are adapted in the Slepian-Wolf coding system. In order to estimate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.07740 شماره
صفحات -
تاریخ انتشار 2017